#include<bits/stdc++.h>
using namespace std;
#define int long long
void solve(){
int n;
cin>>n;
vector<int> a(n),b(n);
for(int i=0;i<n;i++){
cin>>a[i]>>b[i];
}
vector<char> a1(n,'0'),b1(n,'0');
int p1=0,p2=0;
//k=0
for(int i=0;i<n;i++){
if(a[p1]<b[p2]){
a1[p1]='1';
p1++;
}
else{
b1[p2]='1';
p2++;
}
}
//k=n/2
for(int i=1;2*i<=n;i++){
a1[i-1]='1';
b1[i-1]='1';
}
for(auto it:a1){
cout<<it;
}
cout<<endl;
for(auto it:b1){
cout<<it;
}
cout<<endl;
}
int32_t main()
{
int tc=1;
// cin>>tc;
while(tc--){
solve();
}
return 0;
}
Ali and Helping innocent people | Book of Potion making |
Duration | Birthday Party |
e-maze-in | Bricks Game |
Char Sum | Two Strings |
Anagrams | Prime Number |
Lexical Sorting Reloaded | 1514A - Perfectly Imperfect Array |
580A- Kefa and First Steps | 1472B- Fair Division |
996A - Hit the Lottery | MSNSADM1 Football |
MATCHES Playing with Matches | HRDSEQ Hard Sequence |
DRCHEF Doctor Chef | 559. Maximum Depth of N-ary Tree |
821. Shortest Distance to a Character | 1441. Build an Array With Stack Operations |
1356. Sort Integers by The Number of 1 Bits | 922. Sort Array By Parity II |
344. Reverse String | 1047. Remove All Adjacent Duplicates In String |
977. Squares of a Sorted Array | 852. Peak Index in a Mountain Array |
461. Hamming Distance | 1748. Sum of Unique Elements |